Solving games

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving games: Dependence of applicable solving procedures

We introduce an alternative concept to determine the solvability of two-player games with perfect information. This concept — based on games currently solved — claims that the applicable solving procedures have a significant influence on the solvability of games. This contrasts with current views that suggest that solvability is related to state-space and game-tree complexity. Twenty articles o...

متن کامل

Solving Cooperative Reliability Games

Cooperative games model the allocation of profit from joint actions, following considerations such as stability and fairness. We propose the reliability extension of such games, where agents may fail to participate in the game. In the reliability extension, each agent only “survives” with a certain probability, and a coalition’s value is the probability that its surviving members would be a win...

متن کامل

Solving Games Without Determinization

The synthesis of reactive systems requires the solution of two-player games on graphs with ω-regular objectives. When the objective is specified by a linear temporal logic formula or nondeterministic Büchi automaton, then previous algorithms for solving the game require the construction of an equivalent deterministic automaton. However, determinization for automata on infinite words is extremel...

متن کامل

Solving Counter Parity Games

We study a class of parity games equipped with counters that evolve according to arbitrary non-negative affine functions. These games capture several cost models for dynamic systems from the literature. We present an elementary algorithm for computing the exact value of a counter parity game, which both generalizes previous results and improves their complexity. To this end, we introduce a clas...

متن کامل

Solving Muller Games via Safety Games

We show how to transform a Muller game with n vertices into a safety game with (n!) vertices whose solution allows to determine the winning regions of the Muller game and a winning strategy for one player.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 2007

ISSN: 0167-6423

DOI: 10.1016/j.scico.2007.01.004